Succinct Greedy Drawings May Be Unfeasible
نویسندگان
چکیده
A greedy drawing is a straight-line drawing that contains a distance-decreasing path for every pair of nodes. A path (v0, v1, . . . , vm) is distance-decreasing if d(vi, vm) < d(vi−1, vm), for i = 1, . . . ,m. Greedy drawings easily support geographic greedy routing. Hence, a natural and practical problem is the one of constructing greedy drawings in the plane, using few bits for representing vertex Cartesian coordinates and using the Euclidean distance as a metric. We show that this may be unfeasible.
منابع مشابه
Succinct Greedy Graph Drawing in the Hyperbolic Plane
We describe an efficient method for drawing any n-vertex simple graph G in the hyperbolic plane. Our algorithm produces greedy drawings, which support greedy geometric routing, so that a message M between any pair of vertices may be routed geometrically, simply by having each vertex that receives M pass it along to any neighbor that is closer in the hyperbolic metric to the message’s eventual d...
متن کاملSuccinct Greedy Graph Drawing in R
In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of always forwarding messages to nodes that are closer to the destination. We show that greedy graph drawing schemes exist for the Euclidean metric in R, for 3-connected planar graphs, with coordinates that can be represented succinctly, that is, with O(log n) bits. Moreover...
متن کاملLamarckian Repair and Darwinian Repair in EMO Algorithms for Multiobjective 0/1 Knapsack Problems
Multiobjective 0/1 knapsack problems have been frequently used as test problems to examine the performance of evolutionary multiobjective optimization algorithms in the literature. It has been reported that their performance strongly depends on the choice of a constraint handling method. In this paper, we examine two implementation schemes of greedy repair: Lamarckian and Darwinian. In the Lama...
متن کاملSuccinct Greedy Geometric Routing in R
In greedy geometric routing, messages are passed in a network embedded in a metric space according to the greedy strategy of always forwarding messages to nodes that are closer to the destination. In this paper, we study greedy geometric routing in R, using the standard Euclidean metric. Greedy geometric routing is not always possible in fixed-dimensional Euclidean spaces, of course, as is the ...
متن کاملAn Algorithm to Construct Greedy Drawings of Triangulations
We show an algorithm to construct a greedy drawing of every given triangulation. The algorithm relies on two main results. First, we show how to construct greedy drawings of a fairly simple class of graphs, called triangulated binary cactuses. Second, we show that every triangulation can be spanned by a triangulated binary cactus. Further, we discuss how to extend our techniques in order to pro...
متن کامل